Variations on Salem–Zygmund results for random trigonometric polynomials: application to almost sure nodal asymptotics
نویسندگان
چکیده
On some probability space (Ω,F,P), we consider two independent sequences (ak)k≥1 and (bk)k≥1 of i.i.d. random variables that are centered with unit variance which admit a moment strictly higher than two. We then the associated trigonometric polynomial fn(t):=1 n ∑k=1nakcos(kt)+bksin(kt), t∈R. In their seminal work, for Rademacher coefficients, Salem Zygmund showed P almost surely: ∀t∈R,1 2π∫02πexpitf n(x)dx→n→∞e−t2 2. other words, if X denotes an variable uniformly distributed over [0,2π], surely, under law X, fn(X) converges in distribution to standard Gaussian variable. this paper, revisit above Salem–Zygmund result from different perspectives. Namely, establish convergence rate adequate metric via Stein’s method, prove functional counterpart CLT, extend it more general distributions also actually holds total variation. As application, case where coefficients have symmetric order 4, show that, any interval [a,b]⊂[0,2π], number real zeros N(fn,[a,b]) fn [a,b] satisfies universal asymptotics n→n→+∞(b−a) π 3.
منابع مشابه
Almost sure asymptotics for the random binary search tree
Consider the complete rooted binary tree T. We construct a sequence Tn, n = 1, 2, . . . of subtrees of T recursively as follows. T1 consists only of the root. Given Tn, we choose a leaf u uniformly at random from the set of all leaves of Tn and add its two children to the tree to create Tn+1. Thus Tn+1 consists of Tn and the children u1, u2 of u, and contains in total 2n+ 1 nodes, including n+ ...
متن کاملThe Almost Sure Convergence for Weighted Sums of Linear Negatively Dependent Random Variables
In this paper, we generalize a theorem of Shao [12] by assuming that is a sequence of linear negatively dependent random variables. Also, we extend some theorems of Chao [6] and Thrum [14]. It is shown by an elementary method that for linear negatively dependent identically random variables with finite -th absolute moment the weighted sums converge to zero as where and is an array of...
متن کاملAlmost Sure Limit Sets of Random Series
I would like to tell you about an easily stated problem which lies at the border of geometry, probability and classical analysis. In the summer of 2005 two undergraduates at McGill University worked in this general area, and were able to make some progress. When posing the project to them I made a certain conjecture, and (as expected) they did not get far enough in their eight week project to b...
متن کاملRandom Sampling of Sparse Trigonometric Polynomials
We study the problem of reconstructing a multivariate trigonometric polynomial having only few non-zero coefficients from few random samples. Inspired by recent work of Candes, Romberg and Tao we propose to recover the polynomial by Basis Pursuit, i.e., by l-minimization. Numerical experiments show that in many cases the trigonometric polynomial can be recovered exactly provided the number N of...
متن کاملAlmost Sure Invariance Principle for Random Piecewise Expanding Maps
The objective of this note is to prove the almost sure invariance principle (ASIP) for a large class of random dynamical systems. The random dynamics is driven by an invertiblemeasure preserving transformation σ of (Ω,F ,P) called the base transformation. Trajectories in the phase space X are formed by concatenations f ω := fσn−1ω ◦ · · · ◦ fσω ◦ fω of maps from a family of maps fω : X → X, ω ∈...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2021
ISSN: ['1083-6489']
DOI: https://doi.org/10.1214/21-ejp716